Number of connected spanning subgraphs on the Sierpinski gasket

نویسندگان

  • Shu-Chiuan Chang
  • Lung-Chi Chen
چکیده

We study the number of connected spanning subgraphs fd,b(n) on the generalized Sierpinski gasket SGd,b(n) at stage n with dimension d equal to two, three and four for b = 2, and layer b equal to three and four for d = 2. The upper and lower bounds for the asymptotic growth constant, defined as zSGd,b = limv→∞ ln fd,b(n)/v where v is the number of vertices, on SG2,b(n) with b = 2, 3, 4 are derived in terms of the results at a certain stage. The numerical values of zSGd,b are obtained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks

Given an undirected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for silicate network, brother cell and sierpiński gasket rhombus.

متن کامل

Spanning Forests on the Sierpinski Gasket

We present the numbers of spanning forests on the Sierpinski gasket SGd(n) at stage n with dimension d equal to two, three and four, and determine the asymptotic behaviors. The corresponding results on the generalized Sierpinski gasket SGd,b(n) with d = 2 and b = 3, 4 are obtained. We also derive the upper bounds of the asymptotic growth constants for both SGd and SG2,b.

متن کامل

Interacting dimers on a Sierpinski gasket

The different manners of embedding subgraphs of many disjoint edges in a parent graph arise in several different chemical and physical contexts. The problem of enumeration, or more generally of weighted summation, of such embeddings seems quite difficult to treat quantitatively, at least for general extended graphs. The special extended parent graph treated here with the inclusion of interactio...

متن کامل

Structure of spanning trees on the two-dimensional Sierpinski gasket

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

متن کامل

Acyclic Edge-coloring of Sierpinski-like Graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by χ′a(G). Sierpinski graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpinski gasket graphs Sn are the graphs naturally defined ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics & Theoretical Computer Science

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2009